s = input()
print("Correct" if len(s) >= 5 and any(list(map(lambda x: x in '0123456789',list(s)))) and any(list(map(lambda x: x.isupper(),list(s)))) and any(list(map(lambda x: x.islower(),list(s)))) else "Too weak")
//ifstream fin("INPUT.TXT");
//ofstream fout("OUTPUT.TXT");
//fin.close();
//fout.close();
//cout << fixed << setprecision(6);
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define ICC ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define str string
#define pb push_back
#define ull unsigned long long
using namespace std;
void NOK(){
ull n, m;
cin >> n >> m;
cout << (n * m) / __gcd(n, m);
}
void b(){
str s;
cin >> s;
if(s.size() < 5){
cout << "Too weak\n";
return;
}
bool ok = false, ok1 = false, ok2 = false;
for(int i = 0; i < s.size(); i ++){
if(s[i]>='A' and s[i]<='Z'){
ok = true;
}
else if(s[i]>='a' and s[i]<='z'){
ok1 = true;
}
else if(s[i]>='0' and s[i]<='9'){
ok2 = true;
}
}
if(ok == true and ok1 == true and ok2 == true){
cout << "Correct\n";
}
else{
cout << "Too weak\n";
}
}
int main(){
ICC
ld t = 1;
///cin >> t;
while(t --){
b();
}
}
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |